1. Foster I, Kesselman C. The grid 2: blueprint for a new computing infrastructure. San Francisco, CA, USA: Morgan Kaufmann Publishers, 2003
2. Buyya R. Economic-based distributed resource management and scheduling for grid computing. Melbourne, Australia: Monash University, 2002
3. Yang J, Yang S, Li M S, et al. An autonomous pricing strategy toward market economy in computational grids. Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC’05): Vol 2, Apr 4-6, 2005, Las Vegas, NV, USA. Los Alamitos, CA, USA: IEEE Computer Society, 2005: 793-794
4. Ghosh P, Roy N, Das K S, et al. A pricing strategy for job allocation in mobile grids using a non-cooperative bargaining theory framework. Journal of Parallel and Distributed Computing, 2005, 65(11): 1366-1383
5. Schwind M, Gujo O, Stockheim T. Dynamic resource prices in a combinatorial grid system. Proceedings of the 8th IEEE International Conference on E-Commerce Technology and the 3rd IEEE International Conference on Enterprise Computing, Jun 26-29, 2006, San Francisco, CA, USA. Piscataway, NJ, USA: IEEE, 2006:49-54
6. Zhao X G, Xu L T, W B. A dynamic price model with demand prediction and task classification in grid. Proceedings of the 6th International Conference on Grid and Cooperative Computing, Aug 16-18, 2007, Urumchi, China. Piscataway, NJ, USA: IEEE, 2007: 775-782
7. Das A, Grosu D. Combinatorial auction-based protocols for resource allocation in grids. Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium(IPDPS’05), Apr 4-8, 2005, Denver, CO, USA. Piscataway, NJ, USA: IEEE, 2005: 23-30
8. de Vries S, Vohra R V. Combinatorial auctions: a survey. INFORMS Journal on Computing, 2003, 15(3): 284-309
9. Andersson A, Tenhunen M, Ygge F. Integer programming for combinatorial auction winner determination. Proceedings of the 4th International Conference on MultiAgent Systems (ICMAS’00), Jul 10-12, 2000, Boston, MA, USA. Los Alamitos, CA, USA: IEEE Computer Society, 2000: 39-46
10. Zurel E, Nisan N. An efficient approximate allocation algorithm for combinatorial auctions. Proceedings of the 3rd ACM Conference on Electronic Commerce, Oct 14-17, 2001, Tampa, FL, USA. New York, NY, USA: ACM, 2001: 125-136
11. Hoos H H, Boutilier C. Solving combinatorial auctions using stochastic local search. Proceedings of the 7th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, Jul 30-Aug 3, 2000, Austin, TX, USA. Menlo Park, CA, USA: AAAI, 2000: 22-29
12. Xia M, Koehler J G, Whinston B A. Pricing combinatorial auctions. European Journal of Operational Research, 2004, 154(1): 251-270
13. Xia M, Stallaert J, Whinston B A. Solving the combinatorial double auction problem. European Journal of Operational Research, 2005, 164(1): 239-251 |